Skeletonization via Distance Maps and Level Sets

نویسندگان

  • Ron Kimmel
  • Doron Shaked
  • Nahum Kiryati
  • Alfred M. Bruckstein
چکیده

A level set approach for computing solutions to incompressible two-phase ow. A viscosity solutions approach to shape-from-shading. SIAM. 19 Proof: Every simply connected shape has a simply connected skeleton 20]. Only circles have skeletons that are single points. Therefore, the skeletons of all other simply connected shapes have at least two end points. The proof follows immediately from Lemma 4. 2 18 Let us prove the rst statement: All points propagating from the arc segments quench each other at the center of the original maximal disk. Assume by contradiction that a propagating arc segment point p 0 meets the another propagating boundary point before it meets any other propagating arc segment point. This implies that the maximal disk touching point p 0 in the new shape has a smaller radius then the maximal disk. This cannot happen, since any such disk is contained in the maximal disk, which is contained in both new shapes. We now show that pairs of generating points on the boundary of the full shape cannot be separated into diierent new shapes. Assume by contradiction that two points that generated a skeleton point of the full shape are located each on the boundary of a diierent new shape. In that case the radius connecting one of those points with the skeleton point corresponding to it must intersect one of the radii connecting the center of the maximal disk to either p or q, in contradiction to Corollary 2. p and q are the points generating the original maximal disk, see Figure 8. To prove the second statement we must show that in the new shapes, each boundary point is quenched by its original twin from the full shape. This is so since otherwise it must be quenched by another point from the boundary of the new shape. But this is impossible: it will not be quenched by another point that belongs to the full shape since it did not happen in the full shape at the rst place; it will not be quenched by a point from the newly introduced circular segments, since we have shown that all the arc segment points are quenched together. 2 The following corollary is a direct consequence of Lemma 3. Corollary 3 The center of a maximal disk that touches the boundary in two separate points, connects two diierent parts of the skeleton. The two parts are the skeletons of …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memory efficient skeletonization of utility maps

An algorithm is presented that allows to perform skeletonization of large maps with much lower memory requirements than with the straightforward approach. The maps are divided into overlapping tiles, which are skeletonized separately, using a Euclidean distance transform. The amount of overlap is controlled by the maximum expected width of any map component and the maximum size of what will be ...

متن کامل

A Continuous Skeletonization Method Based on Level Sets

A robust and efficient method in 2D and 3D for the calculation of skeletons for arbitrary objects is presented. The method is based on the calculation of the distance function with respect to the object boundary. This is combined, in a post processing step, with a new indicator to identify the skeleton, which coincides with the singularity set of the distance map. The indicator is defined as a ...

متن کامل

University of Groningen A Continuous Skeletonization Method Based on Level Sets

A robust and efficient method in 2D and 3D for the calculation of skeletons for arbitrary objects is presented. The method is based on the calculation of the distance function with respect to the object boundary. This is combined, in a post processing step, with a new indicator to identify the skeleton, which coincides with the singularity set of the distance map. The indicator is defined as a ...

متن کامل

Euclidean skeleton via centre-of-maximal-disc extraction

A skeletonization algorithm is presented, characterized by two main features: invariance under isometric transformations of the pattern, and recoverability. The algorithm is driven by the Euclidean distance map of the pattern. Invariance under isometric transformations is guaranteed due to the use of the Euclidean distance to compute the distance map; recoverability is guaranteed by the inclusi...

متن کامل

A Novel Technique of Skeletonization for Feature Extraction in Cadastral Maps

A cadastral map is a map showing the boundaries and ownership of land parcels. The British evolved the present cadastral system for the purposes of governance and revenue collection. Cadastral maps can be treated as base maps for all land related information. Typically, these maps store information pertaining to ownership details, land use, areal extents, type of development that has been made ...

متن کامل

Skeletonization and Distance Transforms of 3D Volumes Using Graphics Hardware

We propose a fast method for computing distance transforms and skeletons of 3D objects using programmable Graphics Processing Units (GPUs). We use an efficient method, called distance splatting, to compute the distance transform, a one-point feature transform, and 3D skeletons. We efficiently implement 3D splatting on GPUs using 2D textures and a hierarchical bi-level acceleration scheme. We sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Vision and Image Understanding

دوره 62  شماره 

صفحات  -

تاریخ انتشار 1995